A New Exact Pattern Matching Algorithm (WEMA)
نویسندگان
چکیده
منابع مشابه
Exact Circular Pattern Matching Using the BNDM Algorithm
In this paper, we discuss a problem that performs searching a circular string on text from bitparallelism. Given a string X = x1x2 · · ·xm, a string X = xixi+1 · · ·xmx1 · · ·xi−1, for 1 ≤ i ≤ m, is a circular string of X. Given a text string T = t1t2 · · · tn and a pattern P , the circular pattern matching problem is to find all occurrences of P i in the text T . Our algorithm only uses the co...
متن کاملImproved-Bidirectional Exact Pattern Matching
In this research, we present an improved version of Bidirectional (BD) exact pattern matching (EPM) algorithm to solve the problem of exact pattern matching. Improved-Bidirectional (IBD) exact pattern matching algorithm introduced a new idea of scanning partial text window (PTW) as well with the pattern to take decision of moving pattern to the right of partial text window. IBD algorithm compar...
متن کاملA FAST Pattern Matching Algorithm
The advent of digital computers has made the routine use of pattern-matching possible in various applications. This has also stimulated the development of many algorithms. In this paper, we propose a new algorithm that offers improved performance compared to those reported in the literature so far. The new algorithm has been evolved after analyzing the well-known algorithms such as Boyer-Moore,...
متن کاملA new algorithm for linear regular tree pattern matching
We consider the problem of linear regular tree pattern matching and describe a new solution based on a bottom up technique. Current bottom up techniques preprocess the patterns and construct a nite state tree pattern matching automaton for the purpose. Though matching time is linear in the size of the subject tree, the size of the automaton can be exponential in the sum of the sizes of all patt...
متن کاملA New Algorithm for Efficient Pattern Matching with Swaps
The Pattern Matching problem with Swaps consists in finding all occurrences of a pattern P in a text T , when disjoint local swaps in the pattern are allowed. In this paper, we present a new efficient algorithm for the Swap Matching problem with short patterns. In particular, we devise a O(nm) general algorithm, named Backward-Cross-Sampling, and show an efficient implementation of it, based on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Sciences
سال: 2014
ISSN: 1812-5654
DOI: 10.3923/jas.2014.193.196